A Switching Criterion for Intensification and Diversification in Local Search for SAT
نویسندگان
چکیده
We propose a new switching criterion, namely the evenness or unevenness of the distribution of variable weights, and use this criterion to combine intensification and diversification in local search for SAT. We refer to the ways in which state-of-the-art local search algorithms adaptG2WSATP and VW select a variable to flip, as heuristic adaptG 2WSATP and heuristic VW , respectively. To evaluate the effectiveness of this criterion, we apply it to heuristic adaptG2WSATP and heuristic VW , in which the former intensifies the search better than the latter, and the latter diversifies the search better than the former. The resulting local search algorithm, which switches between heuristic adaptG2WSATP and heuristic VW in every step according to this criterion, is called Hybrid. Our experimental results show that, on a broad range of SAT instances presented in this paper, Hybrid inherits the strengths of adaptG2WSATP and VW , and exhibits generally better performance than adaptG2WSATP and VW . In addition, Hybrid compares favorably with state-of-the-art local search algorithm R+adaptNovelty+ on these instances. Furthermore, without any manual tuning parameters, Hybrid solves each of these instances in a reasonable time, while adaptG2WSATP , VW , and R+adaptNovelty+ have difficulty on some of these instances.
منابع مشابه
Diversification and Intensification in Parallel SAT Solving
In this paper, we explore the two well-known principles of diversification and intensification in portfolio-based parallel SAT solving. These dual concepts play an important role in several search algorithms including local search, and appear to be a key point in modern parallel SAT solvers. To study their tradeoff, we define two roles for the computational units. Some of them classified as Mas...
متن کاملWeight-Enhanced Diversification in Stochastic Local Search for Satisfiability
Intensification and diversification are the key factors that control the performance of stochastic local search in satisfiability (SAT). Recently, Novelty Walk has become a popular method for improving diversification of the search and so has been integrated in many well-known SAT solvers such as TNM and gNovelty. In this paper, we introduce new heuristics to improve the effectiveness of Novelt...
متن کاملNovelty and Adaptive Novelty
In this paper we briefly describe Novelty and Adaptive Novelty, two high-performance, stochastic local search (SLS) algorithms for SAT. Based on the WalkSAT architecture, these algorithms combine search intensification and diversification feautures that lead to good peformance on a broad range of SAT instances. The performance of the Novelty algorithm critically depends on the setting of a soca...
متن کاملAdaptive Novelty
In this paper we briefly describe Novelty and Adaptive Novelty, two high-performance, stochastic local search (SLS) algorithms for SAT. Based on the WalkSAT architecture, these algorithms combine search intensification and diversification feautures that lead to good peformance on a broad range of SAT instances. The performance of the Novelty algorithm critically depends on the setting of a soca...
متن کاملDiversify Intensification Phases in Local Search for SAT with a New Probability Distribution
A key challenge in developing efficient local search solvers is to intelligently balance diversification and intensification. This study proposes a heuristic that integrates a new dynamic scoring function and two different diversification criteria: variable weights and stagnation weights. Our new dynamic scoring function is formulated to enhance the diversification capability in intensification...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JSAT
دوره 4 شماره
صفحات -
تاریخ انتشار 2008